#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
// 计算两个数的最大公约数
char *multiply(char num1[], char num2[])
{
    int len1 = strlen(num1);
    int len2 = strlen(num2);
    int *intans = (int *)calloc(len1 + len2, sizeof(int));

    char *strans = (char *)malloc((len1 + len2 + 1) * sizeof(char));

    for (int i = 0; i < len1; i++)
    {
        for (int j = 0; j < len2; j++)
        {
            intans[i + j] += (num1[len1 - 1 - i] - '0') * (num2[len2 - 1 - j] - '0');
            intans[i + j + 1] += intans[i + j] / 10;
            intans[i + j] %= 10;
        }
    }

    int anslen = len1 + len2;
    while (anslen > 0 && intans[anslen - 1] == 0)
        anslen--;
    if (!anslen)
    {
        strans[0] = '0';
        strans[1] = '\0';
    }
    else
    {
        for (int i = 0; i < anslen; i++)
        {
            strans[anslen - 1 - i] = intans[i] + '0';
        }
        strans[anslen] = '\0';
    }

    free(intans);
    return strans;
}

int main()
{
    char a[20001], b[2001];
    scanf("%s", a);
    scanf("%s", b);
    puts(multiply(a, b));
}
